Infiltration games on arbitrary graphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Approximate Equilibria in Graphical Games on Arbitrary Graphs

We present PureProp: a new constraint satisfaction algorithm for computing pure-strategy approximate Nash equilibria in complete information games. While this seems quite limited in applicability, we show how PureProp unifies existing algorithms for 1) solving a class of complete information graphical games with arbitrary graph structure for approximate Nash equilibria (Kearns et al., 2001; Ort...

متن کامل

Seating Rearrangements on Arbitrary Graphs

In this paper, we exhibit a combinatorial model based on seating rearrangements, motivated by some problems proposed in the 1990’s by Kennedy, Cooper, and Honsberger. We provide a simpler interpretation of their results on rectangular grids, and then generalize the model to arbitrary graphs. This generalization allows us to pose a variety of well–motivated counting problems on other frequently ...

متن کامل

Combinatorial Games on Graphs

The theory of combinatorial games is a rapidly developing subject of modern combinatorics. It is concerned with the study of certain twoplayer-games, ranging from popular games as Tic-Tac-Toe and Connect Four to merely abstract games defined in graph-theoretic terms. Besides being of interest on their own right, combinatorial games are strongly connected to other areas of combinatorics, such as...

متن کامل

Flooding games on graphs

We study a discrete di usion process introduced in some combinatorial puzzles called Flood-It, Mad Virus or HoneyBee that can be played online and whose computational complexities have recently been studied. Originally de ned on regular boards, we show that studying their dynamics directly on general graphs is valuable: we synthesize and extend previous results, we show how to solve Flood-It on...

متن کامل

Games on graphs

Evolution occurs in populations of reproducing individuals. The trajectories and outcomes of evolutionary processes depend on the structure of the population. Evolutionary graph theory is a powerful approach to studying the consequences of spatial or social population structure. The vertices of the graph represent individuals. The edges determine who interacts with whom for game payoff and who ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1992

ISSN: 0022-247X

DOI: 10.1016/0022-247x(92)90295-o